منابع مشابه
Game semantics for first-order logic
We refine HO/N game semantics with an additional notion of pointer (mu-pointers) and extend it to first-order classical logic with completeness results. We use a Church style extension of Parigot’s lambda-mu-calculus to represent proofs of first-order classical logic. We present some relations with Krivine’s classical realizability and applications to type isomorphisms.
متن کاملPresentation of a Game Semantics for First-Order Propositional Logic
Game semantics aim at describing the interactive behaviour of proofs by interpreting formulas as games on which proofs induce strategies. In this article, we introduce a game semantics for a fragment of first order propositional logic. One of the main difficulties that has to be faced when constructing such semantics is to make them precise by characterizing definable strategies – that is strat...
متن کاملA Denotational Semantics for First-Order Logic
In Apt and Bezem [AB99) we provided a computational interpretation of first-order formulas over arbitrary interpretations. Here we complement this work by introducing a denotational semantics for first-order logic. Additionally, by allowing an assignment of a non-ground term to a variable we introduce in this framework logical variables. The semantics combines a number of well-known ideas from ...
متن کاملFirst-Order, Curry-Typed Logic for Natural Language Semantics
The paper presents Property Theory with Curry Typing (PTCT) where the language of terms and well-formed formulæ are joined by a language of types. In addition to supporting fine-grained intensionality, the basic theory is essentially first-order, so that implementations using the theory can apply standard first-order theorem proving techniques. The paper sketches a system of tableau rules that ...
متن کاملSound search in a denotational semantics for first order logic
In this paper we adapt the definitions and results from Apt and Ver-meulen in [4] to include important ideas about search and choice into the system. We give motivating examples. Then we set up denotational semantics for first order logic along the lines of Apt [1] and Apt and Vermeulen [4]. The semantic universe includes states that consist of two components: a substitution, which can be seen ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2010
ISSN: 1860-5974
DOI: 10.2168/lmcs-6(4:3)2010